Generalized colorings and avoidable orientations
نویسندگان
چکیده
منابع مشابه
Generalized colorings and avoidable orientations
Gallai and Roy proved that a graph is k-colorable if and only if it has an orientation without directed paths of length k. We initiate the study of analogous characterizations for the existence of generalized graph colorings, where each color class induces a subgraph satisfying a given (hereditary) property. It is shown that a graph is partitionable into at most k independent sets and one induc...
متن کاملColorings and orientations of graphs
Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In particular, the following result is proved: If G is a directed graph with maximum outdegree d, and if the number of Eulerian subgraphs of G with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges then for any assignment of a ...
متن کاملColorings and Orientations of Matrices and Graphs
We introduce colorings and orientations of matrices as generalizations of the graph theoretic terms. The permanent per(A[ζ|ξ]) of certain copies A[ζ|ξ] of a matrix A can be expressed as a weighted sum over the orientations or the colorings of A . When applied to incidence matrices of graphs these equations include Alon and Tarsi’s theorem about Eulerian orientations and the existence of list co...
متن کاملCircular colorings, orientations, and weighted digraphs
In this paper we prove that if a weighted symmetric digraph (~ G, c) has a mapping T : E( ~ G) → {0, 1} with T (xy) + T (yx) = 1 for all arcs xy in ~ G such that for each dicycle C satisfying 0 < |C|c(mod r) < maxxy∈E(~ G) c(xy) + c(yx) we have |C|c/|C|T ≤ r, then (~ G, c) has a circular r-coloring. Our result generalizes the work of Zhu (J. Comb. Theory, Ser. B, 86 (2002) 109-113) concerning t...
متن کاملOn Counting Generalized Colorings
The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, as well as the matching polynomial, the cover polynomial and the various interlace polynomials fall into this category. In this paper we present a framework of graph polynomials based on counting functions of generalized colorin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 1997
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1047